A Shifted Power Method for Homogenous Polynomial Optimization over Unit Spheres
نویسندگان
چکیده
منابع مشابه
solution of security constrained unit commitment problem by a new multi-objective optimization method
چکیده-پخش بار بهینه به عنوان یکی از ابزار زیر بنایی برای تحلیل سیستم های قدرت پیچیده ،برای مدت طولانی مورد بررسی قرار گرفته است.پخش بار بهینه توابع هدف یک سیستم قدرت از جمله تابع هزینه سوخت ،آلودگی ،تلفات را بهینه می کند،و هم زمان قیود سیستم قدرت را نیز برآورده می کند.در کلی ترین حالتopf یک مساله بهینه سازی غیر خطی ،غیر محدب،مقیاس بزرگ،و ایستا می باشد که می تواند شامل متغیرهای کنترلی پیوسته و گ...
Multiplicative Approximations for Polynomial Optimization Over the Unit Sphere
We consider the following basic problem: given an n-variate degree-d homogeneous polynomial f with real coefficients, compute a unit vector x ∈ Rn that maximizes | f (x)|. Besides its fundamental nature, this problem arises in many diverse contexts ranging from tensor and operator norms to graph expansion to quantum information theory. The homogeneous degree 2 case is efficiently solvable as it...
متن کاملBiquadratic Optimization Over Unit Spheres and Semidefinite Programming Relaxations
This paper studies the so-called bi-quadratic optimization over unit spheres min x∈Rn,y∈Rm ∑ 1≤i,k≤n, 1≤j,l≤m bijklxiyjxkyl subject to ‖x‖ = 1, ‖y‖ = 1. We show that this problem is NP-hard and there is no polynomial time algorithm returning a positive relative approximation bound. After that, we present various approximation methods based on semidefinite programming (SDP) relaxations. Our theo...
متن کاملShifted Power Method for Computing Tensor Eigenpairs
Abstract. Recent work on eigenvalues and eigenvectors for tensors of order m ≥ 3 has been motivated by applications in blind source separation, magnetic resonance imaging, molecular conformation, and more. In this paper, we consider methods for computing real symmetric-tensor eigenpairs of the form Axm−1 = λx subject to ‖x‖ = 1, which is closely related to optimal rank-1 approximation of a symm...
متن کاملOptimization over Positive Polynomial Matrices
Positive polynomial matrices play a fundamental role in systems and control theory. We give here a simplified proof of the fact that the convex set of positive polynomial matrices can be parameterized using block Hankel and block Toeplitz matrices. We also show how to derive efficient computational algorithms for optimization problems over positive pseudo polynomial matrices over the real line,...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Mathematics Research
سال: 2015
ISSN: 1916-9809,1916-9795
DOI: 10.5539/jmr.v7n2p175